quasirecognition by prime graph of finite simple groups ${}^2d_n(3)$
نویسندگان
چکیده
let $g$ be a finite group. in [ghasemabadi et al., characterizations of the simple group ${}^2d_n(3)$ by prime graph and spectrum, monatsh math., 2011] it is proved that if $n$ is odd, then ${}^2d _n(3)$ is recognizable by prime graph and also by element orders. in this paper we prove that if $n$ is even, then $d={}^2d_{n}(3)$ is quasirecognizable by prime graph, i.e. every finite group $g$ with $gamma(g)= gamma(d)$ has a unique nonabelian composition factor and this factor is isomorphic to $d$.
منابع مشابه
Quasirecognition by Prime Graph of the Groups
Let G be a finite group. The prime graph Γ(G) of G is defined as follows: The set of vertices of Γ(G) is the set of prime divisors of |G| and two distinct vertices p and p′ are connected in Γ(G), whenever G has an element of order pp′. A non-abelian simple group P is called recognizable by prime graph if for any finite group G with Γ(G) = Γ(P ), G has a composition factor isomorphic to P . In [...
متن کاملSimple groups with the same prime graph as $D_n(q)$
Vasil'ev posed Problem 16.26 in [The Kourovka Notebook: Unsolved Problems in Group Theory, 16th ed.,Sobolev Inst. Math., Novosibirsk (2006).] as follows:Does there exist a positive integer $k$ such that there are no $k$ pairwise nonisomorphicnonabelian finite simple groups with the same graphs of primes? Conjecture: $k = 5$.In [Zvezdina, On nonabelian simple groups having the same prime graph a...
متن کامل2-recognizability of the simple groups $B_n(3)$ and $C_n(3)$ by prime graph
Let $G$ be a finite group and let $GK(G)$ be the prime graph of $G$. We assume that $ngeqslant 5 $ is an odd number. In this paper, we show that the simple groups $B_n(3)$ and $C_n(3)$ are 2-recognizable by their prime graphs. As consequences of the result, the characterizability of the groups $B_n(3)$ and $C_n(3)$ by their spectra and by the set of orders of maximal abelian subgroups are ...
متن کامل2-quasirecognizability of the simple groups B_n(p) and C_n(p) by prime graph
Let G be a finite group and let $GK(G)$ be the prime graph of G. We assume that $n$ is an odd number. In this paper, we show that if $GK(G)=GK(B_n(p))$, where $ngeq 9$ and $pin {3,5,7}$, then G has a unique nonabelian composition factor isomorphic to $B_n(p)$ or $C_n(p)$ . As consequences of our result, $B_n(p)$ is quasirecognizable by its spectrum and also by a new proof, the ...
متن کاملQuasirecognition by the prime graph of L_3(q) where 3 < q < 100
Let $G$ be a finite group. We construct the prime graph of $ G $,which is denoted by $ Gamma(G) $ as follows: the vertex set of thisgraph is the prime divisors of $ |G| $ and two distinct vertices $ p$ and $ q $ are joined by an edge if and only if $ G $ contains anelement of order $ pq $.In this paper, we determine finite groups $ G $ with $ Gamma(G) =Gamma(L_3(q)) $, $2 leq q < 100 $ and prov...
متن کاملFinite Simple Groups with Narrow Prime Spectrum
We find the nonabelian finite simple groups with order prime divisors not exceeding 1000. More generally, we determine the sets of nonabelian finite simple groups whose maximal order prime divisor is a fixed prime less than 1000. Our results are based on calculations in the computer algebra system GAP.
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
international journal of group theoryناشر: university of isfahan
ISSN 2251-7650
دوره 3
شماره 4 2014
کلمات کلیدی
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023